Arbitrarily varying channels with states sequence known to the sender
نویسندگان
چکیده
منابع مشابه
MIMO Wiretap Channels with Arbitrarily Varying Eavesdropper Channel States
In this work, a class of information theoretic secrecy problems is addressed where the eavesdropper channel states are completely unknown to the legitimate parties. In particular, MIMO wiretap channel models are considered where the channel of the eavesdropper is arbitrarily varying over time. Assuming that the number of antennas of the eavesdropper is limited, the secrecy rate of the MIMO wire...
متن کاملArbitrarily varying channels with constrained inputs and states
Random coding theorems are proved for discrete memoryless arbitrarily varying channels (AVCs) with constraints on the transmitted codewords and channel state sequences. We consider two types of constraints peak (i.e., required for eacb n-length sequence almost d y ) and average (over the message set or over an ensemble). For peak constraints on the c o d e d and on the channel state sequences, ...
متن کاملGaussian arbitrarily varying channels
The arbitrarily varying channel (AVC) can be interpreted as a model of a channel jammed by an intelligent and unpredictable adversary. We investigate the asymptotic reliability of optimal random block codes on Gaussian arbitrarily varying channels (GAVC’s). A GAVC is a discrete-time memoryless Gaussian channel with input power constraint PT and noise power N,, which is further corrupted by an a...
متن کاملArbitrarily Varying Wiretap Channel with State Sequence Known or Unknown at the Receiver
The secrecy capacity problems over the general arbitrarily varying wiretap channel, with respect to the maximal decoding error probability and strong secrecy criterion, are considered, where the channel state sequence may be known or unknown at the receiver. In the mean time, it is always assumed that the channel state sequence is known at the eavesdropper and unknown at the transmitter. Capaci...
متن کاملCapacity Results for Arbitrarily Varying Wiretap Channels
In this work the arbitrarily varying wiretap channel AVWC is studied. We derive a lower bound on the random code secrecy capacity for the average error criterion and the strong secrecy criterion in the case of a best channel to the eavesdropper by using Ahlswede’s robustification technique for ordinary AVCs. We show that in the case of a non-symmetrisable channel to the legitimate receiver the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 1986
ISSN: 0018-9448
DOI: 10.1109/tit.1986.1057222